Refining data flow information using infeasible paths

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Refining Information Extraction Rules using Data Provenance

Developing high-quality information extraction (IE) rules, or extractors, is an iterative and primarily manual process, extremely time consuming, and error prone. In each iteration, the outputs of the extractor are examined, and the erroneous ones are used to drive the refinement of the extractor in the next iteration. Data provenance explains the origins of an output data, and how it has been ...

متن کامل

Automatically Detecting Equivalent Mutants and Infeasible Paths

Mutation testing is a technique for testing software units that has great potential for improving the quality of testing, and thereby increasing our ability to assure the high reliability of critical software. It will be shown that recent advances in mutation research have brought a practical mutation testing system closer to reality. One recent advance is a partial solution to the problem of a...

متن کامل

The Minimum Universal Cost Flow in an Infeasible Flow Network

In this paper the concept of the Minimum Universal Cost Flow (MUCF) for an infeasible flow network is introduced. A new mathematical model in which the objective function includes the total costs of changing arc capacities and sending flow is built and analyzed. A polynomial time algorithm is presented to find the MUCF.

متن کامل

Relaxing Event Densities by Exploiting Infeasible Paths in Control Flow Graphs

Common real-time analysis techniques for embedded systems mainly concentrate on a task model where every single activation of a task leads to a single outgoing event that is emitted at the end of the task’s computation. An extension has been introduced that allows for multiple events to occur during a single job by respecting the control flow inside a task in order to recalculate the worst-case...

متن کامل

Interpolating sparse scattered data using flow information

Scattered data interpolation and approximation techniques allow for the reconstruction of a scalar field based upon a finite number of scattered samples of the field. In general, the fidelity of the reconstruction with respect to the original scalar field tends to deteriorate as the number of samples decreases. For the situation of very sparse sampling, the results may not be acceptable at all....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM SIGSOFT Software Engineering Notes

سال: 1997

ISSN: 0163-5948

DOI: 10.1145/267896.267921